Improved upper bounds for the availabilities in a fixed time interval for multistate monotone systems
نویسندگان
چکیده
منابع مشابه
Bounds for the availabilities for multistate monotone systems based on decomposition into stochastically independent modules
Multistate monotone systems are used to describe technological or biological systems when the system itself and its components can perform at different operationally meaningful levels. This generalizes the binary monotone systems used in standard reliability theory. In this paper we consider the availabilities and unavailabilities of the system in an interval, i.e. the probabilities that the sy...
متن کاملUncertainty Bounds for a Monotone Multistate System
We consider a monotone multistate system with conditionally independent compo nents given the component reliabilities and random component reliabilities Upper and lower bounds are derived for the moments of the random reliability function extending results for binary systems The second moment of the reliability function is given spe cial attention as this quantity is used to calculate the stand...
متن کاملa time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
the search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولImproved Capacity Upper Bounds for the Discrete-Time Poisson Channel
We present new capacity upper bounds for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed by one of the authors for the seemingly unrelated problem of upper bounding the capacity of binary deletion and repetition channels. Previously, the best known capacity upper bound in the regime where the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1986
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800015901